#include <iostream>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

// 2099. 找到和最大的长度为 K 的子序列
// https://leetcode.cn/problems/find-subsequence-of-length-k-with-the-largest-sum/description/?envType=daily-question&envId=2025-06-28

class Solution
{
public:
    vector<int> maxSubsequence(vector<int> &nums, int k)
    {
        vector<pair<int, int>> recordIndexOfNum;
        for (int i = 0; i < nums.size(); i++)
        {
            recordIndexOfNum.push_back({nums[i], i});
        }

        sort(recordIndexOfNum.begin(), recordIndexOfNum.end(), greater<int>());
        
    }
};

int main()
{
    return 0;
}